Fuzzy proximity bases and subbases

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Markov bases and subbases for bounded contingency tables

In this paper we study the computation of Markov bases for contingency tables whose cell entries have an upper bound. In general a Markov basis for unbounded contingency table under a certain model differs from a Markov basis for bounded tables. Rapallo and Rogantin (2007) applied Lawrence lifting to compute a Markov basis for contingency tables whose cell entries are bounded. However, in the p...

متن کامل

Non-Archimedean fuzzy metric spaces and Best proximity point theorems

In this paper, we introduce some new classes of proximal contraction mappings and establish  best proximity point theorems for such kinds of mappings in a non-Archimedean fuzzy metric space. As consequences of these results, we deduce certain new best proximity and fixed point theorems in partially ordered non-Archimedean fuzzy metric spaces. Moreover, we present an example to illustrate the us...

متن کامل

Intuitionistic fuzzy proximity spaces

We introduce the concept of the intuitionistic fuzzy proximity as a generalization of fuzzy proximity, and investigate its properties. Also we investigate the relationship among intu-itionistic fuzzy proximity and fuzzy proximity, and intuitionistic fuzzy topology. 1. Introduction. As a generalization of fuzzy sets, the concept of intuitionistic fuzzy sets was introduced by Atanassov [1]. Recen...

متن کامل

Fuzzy Bases of Fuzzy Domains

This paper is an attempt to develop quantitative domain theory over frames. Firstly, we propose the notion of a fuzzy basis, and several equivalent characterizations of fuzzy bases are obtained. Furthermore, the concept of a fuzzy algebraic domain is introduced, and a relationship between fuzzy algebraic domains and fuzzy domains is discussed from the viewpoint of fuzzy basis. We finally give a...

متن کامل

Subbases, Convex Sets, and Hyperspaces

S[ and Sg are then said to separate (or: to screen) S± and S2. Finally, Sf is called a binary subbase if each linked system S^ (zS^ (i.e., a subcollection S^' of ^ of which any two members meet) satisfies ς\Sf'φ 0. It is well-known that a binary subbase is TΊ (cf. van Mill [9, Lemma 1]), that a space carrying a binary subbase is compact (use Alexander's lemma), and that a space is completely re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1980

ISSN: 0022-247X

DOI: 10.1016/0022-247x(80)90167-5